graph searching
英 [ɡræf ˈsɜːtʃɪŋ]
美 [ɡræf ˈsɜːrtʃɪŋ]
网络 图搜索
双语例句
- Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
二分搜索算法，图形搜索算法，排序算法，以及基于树的搜索算法比如极大极小树，这些基本的算法或许也是重要的基础。 - Design of Software System in Network Graph Generation for Generation Unit's Maintenance Based on Searching Algorithm
基于路径搜索的发电公司机组检修网络计划软件系统的设计 - A plan recognition algorithm based on knowledge graph presented in this paper can change the plan recognition problem into the graph searching one. This method not only prompts efficiency but also gives the same result as Kautz's.
所提出的基于规划知识图的规划识别算法把规划的识别问题转化为图搜索问题，因而其效率更高，但其识别结果与Kautz方法是一致的。 - United Structure of Point-Arc for Network Graph and It's Application in GISs Shortest Path Searching
图的节点-弧段联合结构表示法及其在GIS最优路径选取中的应用 - Service composition graph can be built automatically by executing the reverse searching method. Multiple service qualities have been considered comprehensively when selecting the optimized composition plan.
通过反向搜索原子服务的方法自动生成服务组合图，并基于多种服务质量综合考虑从服务组合图中选择最优的服务组合方案。 - Solve the problem of circle path in graph by searching
用遍历方式求解图中是否存在回路问题 - The method makes use of closed signal flow graph matrix derived from the minimum system equations of an SC network. In the implementation of the method, the established technique of loop searching and sorting are used.
这种方法是从网络的最小系统方程出发，推出描述网络的闭合信号流图矩阵，从而通过寻找回路和分类获得符号网络函数。 - An incremental clustering algorithm that is phrase-based, online and avoiding Chinese word segmentation has been proposed based on phrase-based document index model that is incremental constructed using graph technique for Chinese searching result.
本文在一种采用图结构、基于短语的文档索引模型的基础上，提出了一种基于短语匹配的、在线的、无需进行中文分词的增量聚类算法来对中文搜索结果进行聚类。 - A similarity measure combining multiple features and layout is also presented. Two attributed graph match methods based on local searching and genetic algorithm are proposed to meet the occasions of different applications.
提出和实现了基于局部搜索和基于遗传算法的两种属性关系图匹配技术，可以适应于不同的应用需求。 - This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms.
这一结果将传统的显式图搜索与隐式图搜索，求一个解的局部搜索与求全体解的遍历搜索，全部统一到同一个模型和若干算法中去。 - This article briefly illustrates the concept of graph and searching method.
对图的概念和遍历方法进行了简单的阐述。 - Secondly, when searching database information associated with the graph, users can click this block and get this block name and the searching result will be displayed by using the block name as the searching keyword.
在进行图形查询时，用户点击某个图形块，从图形块中取得图形块名，将块名作为查询关键词，对数据库进行查询后显示数据库查询结果。 - Finally we propose a rough planning algorithm based on planning graph, include the algorithm of expanding rough planning graph and the algorithm of searching the rough planning graph.
在一系列概念的基础上给出了粗规划问题的两种求解模型，并提出基于规划图的粗规划算法，包括粗规划图的扩张算法和对粗规划图的搜索算法。 - It has an operating process which includes graph acquiring, preprocessing, pattern extracting, searching and explaining, graph combining and output.
它有一个包括图形获取、预处理、模式抽取、搜索与解释、图形复合与输出等环节的工作过程。 - By using Hamilton graph, the problem of wagons 'placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
运用图论中的哈密尔顿图，可以将树枝型专用线取送车问题，转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。 - Methods A method based on heuristic graph searching algorithm ( A algorithm) is proposed to detect carotid intima from ultrasonic images.
方法提出一种基于启发式A算法从超声图像中提取颈动脉内膜边缘的方法。 - Use SQL Solute A Algorithm in Graph Searching
图搜索的A算法和SQL方法 - We developed a new algorithm for de novo interpretation of MS/ MS spectra using graph theory and dynamic alignment between experimental spectrum and theoretical spectrum. The trustworthy peptides from de novo interpretation were used in protein identification via database searching.
我们用图论以及实验谱-理论谱联配（alignment）的方法对串联质谱得到的实验谱进行从头解析，得到了可靠的多肽序列，并应用到数据库搜索中鉴定了相应的蛋白质。 - Use SQL Soluting A~ Algorithm in Graph Searching
图搜索中A~算法的SQL解法 - The application of graph deep optimization searching technology in system integration of drainage areas
图深度优先搜索技术在流域系统集成中的应用 - Because there existed high time complexity in AND/ OR graph search algorithms, it had to reduce the size of problem searching space to improve the practicability of the method.
由于与或图搜索算法具有很高的时间复杂度，因此必须降低问题搜索空间的规模，以提高方法的实用性。 - For the utilization of shape information, we improve the Contour Segment Networks model and device a object contour extraction algorithm based on deep first graph searching.
对于形状信息的应用，本文改进了轮廓连接网络模型，设计了一种新的基于深度优先搜索的目标轮廓提取算法。 - So the approach of graph based link analysis is based on frequent subgraph searching algorithm.
因此频繁子图发现算法，是基于图的链接发现技术的基础。 - To construct a motion graph, quaternion distance is introduced in finding the transition points, and the Dijkstra algorithm is implemented for searching the nearest path between two edges in the motion graph. Through creating transition movements, we can synthesize a piece of smooth motion.
采用基于四元数距离的方法来寻找过渡点进而构建出运动图，引入Dijkstra算法来搜索运动图上两条边之间的最短路径，通过生成过渡运动，合成出一段平滑的运动。 - When dance motions generate, system construct the motion graph for searching the motion segment, then system select motion segment that matches the mapping condition for each music segment through searching the motion graph, finally system synthetize music segment and motion segment on the time sequence.
舞蹈动作生成时，首先构建用于检索动作片段的动作图，然后通过遍历动作图为每个音乐片段选取符合映射条件的动作片段，最后在时间序列上将音乐片段与动作片段进行合成处理。 - By constructing routing resource graph and searching all nodes of the graph by direction, the proposed method generates total and partial configurations and then uses JTAG boundary scan chain to apply test vectors on them and readback results.
本方法通过对布线资源图中节点分方向遍历，生成全局和局部测试配置，用JTAG施加测试向量激励和回读结果。